%------------------------------------------------------------------------------
% File     : Nitpick---2016
% Problem  : SYN416^7 : TPTP v6.4.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_nitpick %d %s

% Computer : n092.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.75MB
% OS       : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Jan 18 18:47:13 EST 2017

% Result   : CounterSatisfiable 24.31s
% Output   : FiniteModel 24.31s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN416^7 : TPTP v6.4.0. Released v5.5.0.
% 0.00/0.04  % Command  : isabelle tptp_nitpick %d %s
% 0.03/0.23  % Computer : n092.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 32218.75MB
% 0.03/0.23  % OS       : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Mon Jan 16 01:36:33 CST 2017
% 0.03/0.23  % CPUTime: 
% 24.31/13.10  Nitpicking formula...
% 24.31/13.10  Timestamp: 01:36:41
% 24.31/13.10  The type bnd_mu passed the monotonicity test; Nitpick might be able to skip
% 24.31/13.10  some scopes
% 24.31/13.10  Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 24.31/13.10  "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 24.31/13.10  Skipping 5000 scopes. (Consider using "mono" or "merge_type_vars" to prevent
% 24.31/13.10  this.)
% 24.31/13.10  Batch 1 of 1000: Trying 5 scopes:
% 24.31/13.10    card bnd_mu = 1 and card TPTP_Interpret.ind = 1
% 24.31/13.10    card bnd_mu = 2 and card TPTP_Interpret.ind = 2
% 24.31/13.10    card bnd_mu = 3 and card TPTP_Interpret.ind = 3
% 24.31/13.10    card bnd_mu = 4 and card TPTP_Interpret.ind = 4
% 24.31/13.10    card bnd_mu = 5 and card TPTP_Interpret.ind = 5
% 24.31/13.10  % SZS status CounterSatisfiable % SZS output start FiniteModel
% 24.31/13.10  Nitpick found a counterexample for card bnd_mu = 3 and
% 24.31/13.10  card TPTP_Interpret.ind = 3:
% 24.31/13.10  
% 24.31/13.10    Skolem constants:
% 24.31/13.10      ??.bnd_mbox_s4.V = i1
% 24.31/13.10      ??.bnd_mbox_s4.V = i1
% 24.31/13.10      ??.bnd_mbox_s4.V = i2
% 24.31/13.10      ??.bnd_mbox_s4.V = i2
% 24.31/13.10      ??.bnd_mvalid.W = i3
% 24.31/13.10    Constants:
% 24.31/13.10      bnd_exists_in_world =
% 24.31/13.10        (\<lambda>x. _)
% 24.31/13.10        (b1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 24.31/13.10         b2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 24.31/13.10         b3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))
% 24.31/13.10      bnd_p = (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)
% 24.31/13.10      bnd_q = (\<lambda>x. _)(i1 := False, i2 := True, i3 := True)
% 24.31/13.10      bnd_rel_s4 =
% 24.31/13.10        (\<lambda>x. _)
% 24.31/13.10        (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 24.31/13.10         i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 24.31/13.10         i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True))
% 24.31/13.10  % SZS output end FiniteModel
% 24.31/13.10  Total time: 3.9 s
%------------------------------------------------------------------------------